Landscape Ruggedness in Evolutionary Algorithms
نویسنده
چکیده
April 1997, Indianapolis, Indiana Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O.Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.
منابع مشابه
Consensus Sequence Plots and Error Thresholds : Tools for Visualisingthe Structure of Fitness
This paper investigates the occurrence of error thresholds in genetic algorithms (GAs) running on a wide range of tness landscape structures. The error threshold, a notion from molecular evolution, is a critical mutation rate beyond which the evolutionary dynamics of a population changes drastically. The paper also introduces Consensus sequence plots, an empirical tool for locating error thresh...
متن کاملHaploid-Diploid Algorithms
This paper uses the recent idea that the fundamental haploid-diploid lifecycle of eukaryotic organisms implements a rudimentary form of learning within evolution. A general approach for evolutionary computation is here derived that differs from all previous known work using diploid representations. The primary role of recombination is also changed from that previously considered in both natural...
متن کاملProblem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes
In this article, we attempt to understand and to contrast the impact of problem features on the performance of randomized search heuristics for black-box multiobjective combinatorial optimization problems. At first, we measure the performance of two conventional dominance-based approaches with unbounded archive on a benchmark of enumerable binary optimization problems with tunable ruggedness, o...
متن کامل2-bit Flip Mutation Elementary Fitness Landscapes
Genetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of k/2 + 1 elementary landscapes. Statistics, including fitness distance correlation (FDC), of Parity’s fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit flip fitness landscape are given. Tests support λ/d as a measure of the ...
متن کاملEstimating the Degree of Neutrality in Fitness Landscapes by the Nei's Standard Genetic Distance - An Application to Evolutionary Robotics -
In recent years, not only ruggedness but also neutrality has been recognized as an important feature of a fitness landscape for genetic search. As it has been reported that the evolutionary dynamics on a fitness landscape with neutrality is clearly different from the canonical explanations, ruggedness alone might be inadequate describing it. Another measure, i.e., neutrality is required. In thi...
متن کامل